Evolutionary shape optimization with self-adapting mutation distribution based on the Cholesky decomposition

نویسنده

  • B. Kost
چکیده

The investigations in the paper have been carried out against the background of an integrated approach to the structural design problem. Due to the complex nature of the search space and the continous-discrete-binary system vector in the general case of structural optimization, conventional methods can not be used. Evolution strategies have shown their general capability to solve the sizing and the topology problem. On the other hand when employing evolution strategies to the subproblem of shape optimization they tend to get stuck due to an unsufficient step size adaptation. Therefore, a covariance matrix approach has been used for the self-adaptation of the mutation distribution during the evolutionary shape optimization process. The necessary decomposition of the covariance matrix has been carried out with the Cholesky method. The results of this approach are compared to the usual general and individual step size adaptation procedures of evolution strategies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Use of the q-Gaussian mutation in evolutionary algorithms

This paper proposes the use of the qGaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real parameter q. In the proposed method, the real parameter q of the q-Gaussian mutation is encoded in the chromosome of individuals and hence is allowed to evolve during the evoluti...

متن کامل

Airfoil Shape Optimization with Adaptive Mutation Genetic Algorithm

An efficient method for scattering Genetic Algorithm (GA) individuals in the design space is proposed to accelerate airfoil shape optimization. The method used here is based on the variation of the mutation rate for each gene of the chromosomes by taking feedback from the current population. An adaptive method for airfoil shape parameterization is also applied and its impact on the optimum desi...

متن کامل

New Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem

Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...

متن کامل

What Weights Work for You? Adapting Weights for Any Pareto Front Shape in Decomposition-based Evolutionary Multi-Objective Optimisation

The quality of solution sets generated by decomposition-based evolutionary multiobjective optimisation (EMO) algorithms depends heavily on the consistency between a given problem’s Pareto front shape and the specified weights’ distribution. A set of weights distributed uniformly in a simplex often lead to a set of well-distributed solutions on a Pareto front with a simplex-like shape, but may f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003